New Results on Simple Stochastic Games
نویسندگان
چکیده
We study the problem of solving simple stochastic games, and give both an interesting new algorithm and a hardness result. We show a reduction from fine approximation of simple stochastic games to coarse approximation of a polynomial sized game, which can be viewed as an evidence showing the hardness to approximate the value of simple stochastic games. We also present a randomized algorithm that runs in Õ( √ |VR|!) time, where |VR| is the number of RANDOM vertices and Õ ignores polynomial terms. This algorithm is the fastest known algorithm when |VR| = ω(logn) and |VR| = o( √ min |Vmin|, |Vmax|) and it works for general (non-stopping) simple stochastic games.
منابع مشابه
Stationary Markov perfect equilibria in discounted stochastic games
The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called “(decomposable) coarser transition kernels”. This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and stateindependent transitions, and stochastic games with mixtures of constant transition kern...
متن کاملA reduction from parity games to simple stochastic games
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turnbased or concurrent moves, and deterministic or stochastic transitions. In this paper, we are inte...
متن کاملA reduction from parity games to simple stochastic games
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turnbased or concurrent moves, and deterministic or stochastic transitions. In this paper, we are inte...
متن کاملNew Algorithms for Solving Simple Stochastic Games
We present new algorithms for determining optimal strategies for two-player games with probabilistic moves and reachability winning conditions. Such games, known as simple stochastic games, were extensively studied by A.Condon [2,3]. Many interesting problems, including parity games and hence also mu-calculus model checking, can be reduced to simple stochastic games. It is an open problem, whet...
متن کاملLinear Complementarity and P-Matrices for Stochastic Games
We define the first nontrivial polynomially recognizable subclass of P-matrixGeneralized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No such classes/rules were previously known. We show that a subclass of Shapley turn-based stochastic games, subsuming Condon’s simple stochastic games, is reducible to the new class of GLCPs. Based on this we suggest the new strongly...
متن کامل